| Definitions | sys-antecedent(es;Sys), x:A  B(x),  x:A. B(x), t  T, s = t, P   Q, chain-consistent(f;chain), ES, Type, AbsInterface(A),  , <a, b>,  , E, type List, x:A  B(x),  b, left + right, {x:A| B(x)} , Top, E(X), f(a), Id, y is f*(x), e  loc e' , x <<= y, P & Q,  x:A. B(x), let x,y = A in B(x;y), t.1, a:A fp B(a), strong-subtype(A;B), e c e', EqDecider(T), Unit, IdLnk, EOrderAxioms(E; pred?; info), EState(T), Knd,   x. t(x), x,y. t(x;y), kindcase(k; a.f(a); l,t.g(l;t) ), Msg(M),  ,  , val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), e < e', r s, constant_function(f;A;B), e  X, loc(e), kind(e), SWellFounded(R(x;y)), pred!(e;e'), !Void(),  x:A.B(x), S  T, suptype(S; T), first(e),  A, pred(e), x.A(x), P  Q, a < b, hd(l), L1 L2, adjacent(T;L;x;y), (x l), no_repeats(T;l), False, y=f*(x) via L, loc(e), (e <loc e'), x << y, A c B, Atom$n, f**(e), {T}, kind(e), first(e), s ~ t, SQType(T), case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , source(l), destination(l), es-init(es;e), P  Q, P Q, isrcv(e), es-first-from(es;e;l;tg), isrcv(k), lastchange(x;e), (last change to x before e), last(L), True,  T, {i..j }, a = b, locl(a), x before y l, Dec(P),  , A B, Atom, x,y:A//B(x;y), b | a, a ~ b, |p|, a b, a <p b, |g|, a < b, x f y, |r|, xL. P(x), (xL.P(x)),  , r < s, q-rel(r;x), Outcome, dstype(TypeNames; d; a), l_disjoint(T;l1;l2), MaName, (e < e'), e<e'.P(e), ee'.P(e), e<e'. P(e), ee'.P(e), e[e1,e2).P(e), e[e1,e2).P(e), e[e1,e2].P(e), e[e1,e2].P(e), e(e1,e2].P(e), ||as||, #$n, X(e), l[i], increasing(f;k), ff, inr x , tt, inl x , f(x)?z, SqStable(P), a =!x:T. Q(x), InvFuns(A;B;f;g), Inj(A;B;f), IsEqFun(T;eq), Refl(T;x,y.E(x;y)), Sym(T;x,y.E(x;y)), Trans(T;x,y.E(x;y)), AntiSym(T;x,y.R(x;y)), Connex(T;x,y.R(x;y)), CoPrime(a,b), Ident(T;op;id), Assoc(T;op), Comm(T;op), Inverse(T;op;id;inv), BiLinear(T;pl;tm), IsBilinear(A;B;C;+a;+b;+c;f), IsAction(A;x;e;S;f), Dist1op2opLR(A;1op;2op), fun_thru_1op(A;B;opa;opb;f), FunThru2op(A;B;opa;opb;f), Cancel(T;S;op), monot(T;x,y.R(x;y);f), IsMonoid(T;op;id), IsGroup(T;op;id;inv), IsMonHom{M1,M2}(f), a b, IsIntegDom(r), IsPrimeIdeal(R;P), f g, as @ bs, e(e1,e2].P(e), @e(x v), pred(e), sender(e), lnk(k), es-lnk(es; e), i j < k, [], [car / cdr], A List, cr-fails-before(es; Sys; chain; x; y) |
| Lemmas | chain-consistent-fails-before, chain-consistent-fails-before3, before-adjacent, increasing wf, length wf nat, select wf, length wf1, int seg wf, le wf, chain-order-antisymmetric, l tricotomy, member sublist, adjacent-member, sublist weakening, es-le transitivity, es-causle transitivity, decidable es-causle, fun-connected-causle, es-causle weakening locl, es-le-causle, es-causle-le, es-causl wf, es-locl-iff, l member wf, no repeats wf, sublist wf, adjacent wf, sq stable from decidable, decidable assert, btrue wf, bfalse wf, decidable equal Id, decidable wf, fun-connected transitivity, l before wf, chain-order-total, chain-order-antireflexive, chain-order transitivity, chain-path-ordered, fun-connected-step, decidable equal es-E-interface, fun-connected-induction, all functionality wrt iff, implies functionality wrt iff, exists functionality wrt iff, and functionality wrt iff, assert-eq-id, eq id wf, es-first wf, fun-connected weakening eq, true wf, squash wf, iff wf, rev implies wf, es-isrcv-loc, Id sq, es-le-loc, es-loc-pred, false wf, guard wf, es-locl wf, chain-order wf, es-loc wf, fun-path wf, kind wf, loc wf, not wf, first wf, pred! wf, strongwellfounded wf, es-is-interface wf, es-causle wf, es-interface wf, top wf, constant function wf, assert wf, bool wf, qle wf, cless wf, val-axiom wf, rationals wf, nat wf, Msg wf, kindcase wf, Knd wf, EState wf, EOrderAxioms wf, IdLnk wf, unit wf, deq wf, event system wf, sys-antecedent wf, es-E-interface-subtype rel, member wf, es-E wf, subtype rel wf, Id wf, chain-order-le wf, es-le wf, fun-connected wf, es-E-interface wf, chain-consistent wf |
